Generalized Davenport-Schinzel Sequences
نویسندگان
چکیده
The extremal function Ex(u, n) (introduced in the theory of DavenportSchinzel sequences in other notation) denotes for a fixed finite alternating sequence u = ababa . . . the maximum length of a finite sequence v over n symbols with no immediate repetition which does not contain u. Here (following the idea of J. Nešetřil) we generalize this concept for arbitrary sequence u. We summarize the already known properties of Ex(u, n) and we present also two new theorems which give good upper bounds on Ex(u, n) for u consisting of (two) smaller subsequences ui provided we have good upper bounds on Ex(ui, n). We use these theorems to describe a wide class of sequences u (”linear sequences”) for which Ex(u, n) = O(n). Both theorems are used for obtaining new superlinear upper bounds as well. We partially characterize linear sequences over three symbols. We also present several problems about Ex(u, n).
منابع مشابه
Generalized Davenport–Schinzel sequences: results, problems, and applications
We survey in detail extremal results on Davenport–Schinzel sequences and their generalizations, from the seminal papers of H. Davenport and A. Schinzel in 1965 to present. We discuss geometric and enumerative applications, generalizations to colored trees, and generalizations to hypergraphs. Eleven illustrative examples with proofs are given and nineteen open problems are posed.
متن کاملNonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme
Davenport-Schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. We show that the maximal length of a Davenport-Schinzel sequence composed of n symbols is 6(noc(n»), where t1.(n)is the functional inverse of Ackermann's function, and is thus very slowly increasing to infinity. This i...
متن کاملKeywords. Davenport{schinzel Sequence; Tree; Extremal Problem 0 Extremal Problems for Colored Trees and Davenport{schinzel Sequences
In the theory of generalized Davenport{Schinzel sequences one estimates the maximum lengths of nite sequences containing no subsequence of a given pattern. Here we investigate a further generalization, in which the class of sequences is extended to the class of colored trees. We determine exactly the extremal functions associated with the properly 2-colored path of four vertices and with the mo...
متن کاملExtremal problems for colored trees and Davenport-Schinzel sequences
In the theory of generalized Davenport–Schinzel sequences one estimates the maximum lengths of finite sequences containing no subsequence of a given pattern. Here we investigate a further generalization, in which the class of sequences is extended to the class of colored trees. We determine exactly the extremal functions associated with the properly 2-colored path of four vertices and with the ...
متن کاملGeneralized Davenport-Schinzel sequences and their 0-1 matrix counterparts
Article history: Received 8 August 2010 Available online xxxx
متن کامل8. Davenport-schinzel Sequences
Definition 18.1 A (n, s)-Davenport-Schinzel sequence is a sequence over an alphabet A of size n in which no two consecutive characters are the same and there is no alternating subsequence of the form .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 14 شماره
صفحات -
تاریخ انتشار 1994